منابع مشابه
Multiple-Goal Heuristic Search
This paper presents a new framework for anytime heuristic search where the task is to achieve as many goals as possible within the allocated resources. We show the inadequacy of traditional distance-estimation heuristics for tasks of this type and present alternative heuristics that are more appropriate for multiple-goal search. In particular, we introduce the marginal-utility heuristic, which ...
متن کاملGoal Programming and Heuristic Search
The A* algorithm belongs to the class of best first graph-search algorithms and is frequently used to find minimum-cost paths. Recently, A* has been generalised to solve multiple-objective search problems, returning the set of non-dominated solution paths. This paper presents METAL-A*, an admissible heuristic search algorithm for search problems with lexicographic goals that returns the set of ...
متن کاملHeuristic Search for Planning with Different Forced Goal-Ordering Constraints
Planning with forced goal-ordering (FGO) constraints has been proposed many times over the years, but there are still major difficulties in realizing these FGOs in plan generation. In certain planning domains, all the FGOs exist in the initial state. No matter which approach is adopted to achieve a subgoal, all the subgoals should be achieved in a given sequence from the initial state. Otherwis...
متن کاملA Forward Search Planning Algorithm with a Goal Ordering Heuristic
Forward chaining is a popular strategy for solving classical planning problems and a number of recent successful planners exploit it. To succeed, a forward chaining algorithm must carefully select its next action. In this paper, we introduce a forward chaining algorithm that selects its next action using heuristics that combine backward regression and goal ordering techniques. Backward regressi...
متن کاملGoal-based Adversarial Search - Searching Game Trees in Complex Domains using Goal-based Heuristic
We present a novel approach to reducing adversarial search space by using background knowledge represented in the form of higher-level goals that players tend to pursue in the game. The algorithm is derived from a simultaneous-move modification of the maxn algorithm by only searching the branches of the game tree that are consistent with pursuing player’s goals. The algorithm has been tested on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2006
ISSN: 1076-9757
DOI: 10.1613/jair.1940